Group Recommendations: Axioms, Impossibilities, and Random Walks
نویسندگان
چکیده
We introduce an axiomatic approach to group recommendations, in line of previous work on the axiomatic treatment of trust-based recommendation systems, ranking systems, and other foundational work on the axiomatic approach to internet mechanisms in social choice settings. In group recommendations we wish to recommend to a group of agents, consisting of both opinionated and undecided members, a joint choice that would be acceptable to them. Such a system has many applications, such as choosing a movie or a restaurant to go to with a group of friends, recommending games for online game players, & other communal activities. Our method utilizes a given social graph to extract information on the undecided, relying on the agents influencing them. We first show that a set of fairly natural desired requirements (a.k.a axioms) leads to an impossibility, rendering mutual satisfaction of them unreachable. However, we also show a modified set of axioms that fully axiomatize a group variant of the random-walk recommendation system, expanding a previous result from the individual recommendation case.
منابع مشابه
Generalized (c, d)-Entropy and Aging Random Walks
Complex systems are often inherently non-ergodic and non-Markovian and Shannon entropy loses its applicability. Accelerating, path-dependent and aging random walks offer an intuitive picture for non-ergodic and non-Markovian systems. It was shown that the entropy of non-ergodic systems can still be derived from three of the Shannon–Khinchin axioms and by violating the fourth, the so-called comp...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملRecommender Systems with Random Walks: A Survey
Recommender engines have become an integral component in today's e-commerce systems. From recommending books in Amazon to finding friends in social networks such as Facebook, they have become omnipresent. Generally, recommender systems can be classified into two main categories: content based and collaborative filtering based models. Both these models build relationships between users and items...
متن کاملRandom Walk in an Alcove of an Affine Weyl Group, and Non-colliding Random Walks on an Interval
Abstract. We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine Weyl groups. In all cases, we get determinant formulas for the number of k-step walks. One important example is the region m > x1 > x2 > · · · > xn ...
متن کاملRandom Walks on Finite Quantum Groups
1 Markov chains and random walks in classical probability . . 3 2 Quantum Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Random walks on comodule algebras . . . . . . . . . . . . . . . . . . . . . . 7 4 Random walks on finite quantum groups . . . . . . . . . . . . . . . . . . 11 5 Spatial Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کامل